A General Two-stage Multi-label Ranking Framework
نویسندگان
چکیده
In this paper we develop and study solutions for the multi-label ranking (MLR) problem. Briefly, goal of is not only to assign a set relevant labels data instance but also rank according their importance. To do so propose two-stage model that consists of: (1) classification first selects an unordered instance, and, (2) label ordering orders selected post-hoc in order The advantage such it can represent both dependencies among labels, as well as, We evaluate performance our framework on simulated real-world datasets show its improved compared existing multiple-label solutions.
منابع مشابه
Two stage architecture for multi-label learning
A common approach to solving multi-label learning problems is to use problem transformation methods and dichotomizing classifiers as in the pair-wise decomposition strategy. One of the problems with this strategy is the need for querying a quadratic number of binary classifiers for making a prediction that can be quite time consuming, especially in learning problems with a large number of label...
متن کاملA two-stage model for ranking DMUs using DEA/AHP
In this paper, we present a two-stage model for ranking of decision making units (DMUs) using interval analytic hierarchy process (AHP). Since the efficiency score of unity is assigned to the efficient units, we evaluate the efficiency of each DMU by basic DEA models and calculate the weights of the criteria using proposed model. In the first stage, the proposed model evaluates decision making...
متن کاملA Two-Stage Dual Space Reduction Framework for Multi-label Classification
Multi-label classification has been increasingly recognized since it can classify objects into multiple classes, simultaneously. However, its effectiveness might be sacrificed due to high dimensionality problem in feature space and sparseness problem in label space. To address these issues, this paper proposes a Two-Stage Dual Space Reduction (2SDSR) framework that transforms both feature space...
متن کاملEfficient Two Stage Voting Architecture for Pairwise Multi-label Classification
A common approach for solving multi-label classification problems using problem-transformation methods and dichotomizing classifiers is the pair-wise decomposition strategy. One of the problems with this approach is the need for querying a quadratic number of binary classifiers for making a prediction that can be quite time consuming especially in classification problems with large number of la...
متن کاملOnline Boosting Algorithms for Multi-label Ranking
We consider the multi-label ranking approach to multilabel learning. Boosting is a natural method for multilabel ranking as it aggregates weak predictions through majority votes, which can be directly used as scores to produce a ranking of the labels. We design online boosting algorithms with provable loss bounds for multi-label ranking. We show that our first algorithm is optimal in terms of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... International Florida Artificial Intelligence Research Society Conference
سال: 2021
ISSN: ['2334-0762', '2334-0754']
DOI: https://doi.org/10.32473/flairs.v34i1.128505